class Solution
{
public:
    int numSquares(int n)
    {
        int m = sqrt(n);
        vector<vector<int>> dp(m + 1, vector<int>(n + 1));
        for (int j = 1; j <= n; j++) dp[0][j] = 0x3f3f3f3f;
        for (int i = 1; i <= m; i++)
        {
            for (int j = 0; j <= n; j++)
            {
                dp[i][j] = dp[i - 1][j];
                if (j >= i * i)
                    dp[i][j] = min(dp[i][j], dp[i][j - i * i] + 1);
            }
        }
        return dp[m][n];
    }
};


class Solution
{
public:
    int numSquares(int n)
    {
        int m = sqrt(n);
        vector<int> dp(n + 1);
        for (int j = 1; j <= n; j++) dp[j] = 0x3f3f3f3f;
        for (int i = 1; i <= m; i++)
        {
            for (int j = i * i; j <= n; j++)
            {
                dp[j] = min(dp[j], dp[j - i * i] + 1);
            }
        }
        return dp[n];
    }
};